Sailing towards, and then against, the Graceful Tree Conjecture: some promiscuous results
نویسنده
چکیده
The Graceful Tree Conjecture is getting old – though 40 years are not so many – while researchers form all over the world keep on trying to put an affirmative end to it. Kotzig called a disease the effort of proving it. In this paper we fall into the opposite disease, namely by moving towards the search of a tree that is not graceful. Our first result, on suitable attachments of graceful trees, is however constructive and produces new graceful trees. But the reader might perceive a subtle friction between the combinatorial structure and the arithmetical need of producing a graceful labelling (that sensation will sound perhaps like a warning). Subsequently, the classification of all graceful labellings for a rather simple class of trees will seem at a first glance reassuring for its richness, while a more careful analysis may highlight some heavy constraints for labels, due to the mere structure of trees. Here the question is: what could happen to label constraints if the tree has a quite wild structure? Should we give up gracefulness? Finally, we introduce a polynomial associated to a given tree, which is expected to help the willing researcher to find some ungraceful tree, if any, in the next future.
منابع مشابه
Embedding an Arbitrary Tree in a Graceful Tree
A function f is called a graceful labeling of a graph G with m edges if f is an injective function from V (G) to {0, 1, 2, · · · ,m} such that when every edge uv is assigned the edge label |f(u)− f(v)|, then the resulting edge labels are distinct. A graph which admits a graceful labeling is called a graceful graph. The popular Graceful Tree Conjecture states that every tree is graceful. The Gra...
متن کاملTowards the Graceful Tree Conjecture: A Survey
A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2, . . . , n} such that the induced edge labels are all distinct. An induced edge label is the absolute value of the difference between the two end-vertex labels. The Graceful Tree Conjecture states that all trees have a graceful labelling. In this survey we presen...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملGraceful Tree Conjecture for Infinite Trees
One of the most famous open problems in graph theory is the Graceful Tree Conjecture, which states that every finite tree has a graceful labeling. In this paper, we define graceful labelings for countably infinite graphs, and state and verify a Graceful Tree Conjecture for countably infinite trees.
متن کاملModular Edge-Graceful Trees
Ryan Jones, Western Michigan University We introduce a modular edge-graceful labeling of a graph a dual concept to the common graceful labeling. A 1991 conjecture known as the Modular Edge-Graceful Tree Conjecture states that every tree of order n where n 6≡ 2 (mod 4) is modular edge-graceful. We show that this conjecture is true. More general results and questions on this topic are presented.
متن کامل